Grokking Microsoft Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
Microsoft Easy Problems
Buddy Strings (easy)
Solution: Buddy Strings
Can Place Flowers (easy)
Solution: Can Place Flowers
Reverse a LinkedList (easy)
Solution: Reverse a LinkedList
Maximum Number of Balloons (easy)
Solution: Maximum Number of Balloons
Binary Tree Path Sum (easy)
Solution: Binary Tree Path Sum
Pair with Target Sum (easy)
Solution: Pair with Target Sum
Buy Two Chocolates (easy)
Solution: Buy Two Chocolates
Root Equals Sum of Children (easy)
Solution: Root Equals Sum of Children
Excel Sheet Column Title (easy)
Solution: Excel Sheet Column Title
Merge Strings Alternately (easy)
Solution: Merge Strings Alternately
Min Cost Climbing Stairs (easy)
Solution: Min Cost Climbing Stairs
Plus One (easy)
Solution: Plus One
Intersection of Two Arrays (easy)
Solution: Intersection of Two Arrays
Find the Index of the First Occurrence in a String (easy)
Solution: Find the Index of the First Occurrence in a String
Merge Two Sorted Lists (easy)
Solution: Merge Two Sorted Lists
Microsoft Medium Problems
Nth Digit (medium)
Solution: Nth Digit
Restore IP Addresses (medium)
Solution: Restore IP Addresses
Find Original Array From Doubled Array (medium)
Solution: Find Original Array From Doubled Array
Reverse Words in a String II (medium)
Solution: Reverse Words in a String II
Longest Arithmetic Subsequence (medium)
Solution: Longest Arithmetic Subsequence
Matchsticks to Square (medium)
Solution: Matchsticks to Square
Score of Parentheses (medium)
Solution: Score of Parentheses
Maximum Length of a Concatenated String with Unique Characters (medium)
Solution: Maximum Length of a Concatenated String with Unique Characters
Inorder Successor in BST (medium)
Solution: Inorder Successor in BST
Distribute Coins in Binary Tree (medium)
Solution: Distribute Coins in Binary Tree
Spiral Matrix (medium)
Solution: Spiral Matrix
Delete Node in a BST (medium)
Solution: Delete Node in a BST
Sum of Subarray Minimums (medium)
Solution: Sum of Subarray Minimums
Rotate Image (medium)
Solution: Rotate Image
Combinations (medium)
Solution: Combinations
Maximum Level Sum of a Binary Tree (medium)
Solution: Maximum Level Sum of a Binary Tree
Multiply Strings (medium)
Solution: Multiply Strings
Best Time to Buy and Sell Stock II (medium)
Solution: Best Time to Buy and Sell Stock II
Largest Palindromic Number (medium)
Solution: Largest Palindromic Number
Remove Duplicate Letters (medium)
Solution: Remove Duplicate Letters
Next Permutation (medium)
Solution: Next Permutation
132 Pattern (medium)
Solution: 132 Pattern
Valid Sudoku (medium)
Solution: Valid Sudoku
Number of Islands (medium)
Solution: Number of Islands
Buildings With an Ocean View (medium)
Solution: Buildings With an Ocean View
Microsoft Hard Problems
Regular Expression Matching (hard)
Solution: Regular Expression Matching
First Missing Positive (hard)
Solution: First Missing Positive
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Sliding Window Maximum (hard)
Solution: Sliding Window Maximum
Count Unique Characters of All Substrings of a Given String (hard)
Solution: Count Unique Characters of All Substrings of a Given String
Word Ladder (hard)
Solution: Word Ladder
Word Ladder II (hard)
Solution: Word Ladder II
Number of Flowers in Full Bloom (hard)
Solution: Number of Flowers in Full Bloom
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Solution: Number of Flowers in Full Bloom

Problem Statement

You are given a 2D integer array flowers, where flowers[i] = [starti, endi] means the ith flower will be in full bloom from time starti to endi (inclusive). You are also given another 1D array persons, where persons[i] represents the time when ith person will come to see the flowers.

Return an integer array answer of size n, where answer[i] is the number of flowers that are in full bloom at the ith time.

Examples

Example 1:

  • Input: flowers = [[1,4],[2,2]], persons = [2,3]
  • Expected Output: [2,1]
  • Explanation: At time 2, both flowers are in full bloom. By time 3, the first flower is still in bloom, but the second one has wilted, leaving only one in bloom.

Example 2:

  • Input: flowers = [[5,10],[15,25],[25,30]], persons = [5,10,15,20,25,30]
  • Expected Output: [1,1,1,1,2,1]
  • Explanation: At time 5 and 10, only the first flower is in bloom. At time 15 and 25, only the second flower is in bloom. At time 25, second and third flowers are in bloom, and at time 30 only third flower is in bloom.

Example 3:

  • Input: flowers = [[1,50],[10,14],[6,10]], persons = [11,6,3]
  • Expected Output: [2,2,1]
  • Explanation: At time 11, the first and second flowers are in bloom. At time 6, the first and third flowers are in bloom. At time 3, only first flower is in bloom.

Solution

To solve this problem, we employ a sweep line technique coupled with sorting. This approach is effective because it allows us to efficiently track changes in the state (number of flowers in bloom) over time. Firstly, we preprocess the flowers' bloom intervals by marking the start of a bloom with a positive indicator and the end with a negative indicator. This preprocessing step transforms the problem into one of tracking net changes in bloom count over time.

Sorting this modified list of events (bloom starts and ends) ensures that we encounter these events in chronological order. As we iterate through the sorted events, we adjust our count of flowers in bloom accordingly. For each person's query time, we perform a binary search on the sorted event list to find the number of flowers in bloom up to that point. This method is highly efficient for handling multiple queries, making it superior for scenarios with large datasets and numerous queries.

Step-by-Step Algorithm

  1. Define Structures:

    • Define an event struct with two fields: time (an integer) and change (also an integer, where +1 indicates a bloom start and -1 indicates a bloom end).
  2. Convert Flower Intervals to Events:

    • For each flower interval [start, end] in the input list flowers, create two events:
      • A start event with time = start and change = +1.
      • An end event with time = end + 1 and change = -1.
    • Add these events to a slice of event structs.
  3. Sort the Events:

    • Sort the events first by time in ascending order. If two events have the same time, sort by change to ensure end events are processed before start events if they occur at the same time.
  4. Calculate Prefix Sum of Blooms:

    • Initialize a variable blooms to keep track of the current number of flowers in bloom.
    • Iterate through the sorted events, updating blooms by adding the change value of each event.
    • Store the running total of blooms in a slice prefixSum at each step to keep track of the number of flowers in bloom after each event.
  5. Answer Each Query:

    • For each query time in persons, perform a binary search on the events to find the last event that occurs at or before the query time.
    • Use the index from the binary search to find the corresponding value in prefixSum, which indicates the number of flowers in bloom at the query time.
    • If the binary search does not find a suitable event (returns -1), the result for that query is 0.
  6. Binary Search Implementation:

    • Implement a binary search that searches through the sorted events to find the last event that occurs at or before a given query time.
    • Adjust the left and right pointers based on the mid-event's time compared to the query time, ensuring we find the exact or closest preceding event time.
  7. Return Results:

    • For each query time, add the result (number of flowers in bloom) to a result slice and return this slice as the output of the fullBloomFlowers method.

Algorithm Walkthrough

Input: flowers = [[5,10],[15,25],[25,30]], persons = [5,10,15,20,25,30]

  1. Convert to Events:

    • Events: [(5, +1), (11, -1), (15, +1), (26, -1), (25, +1), (31, -1)]
  2. Sort Events:

    • Sorted Events: [(5, +1), (11, -1), (15, +1), (25, +1), (26, -1), (31, -1)]
  3. Calculate Prefix Sum:

    • After event (5, +1): blooms = 1
    • After event (11, -1): blooms = 0
    • After event (15, +1): blooms = 1
    • After event (25, +1): blooms = 2
    • After event (26, -1): blooms = 1
    • After event (31, -1): blooms = 0
    • Prefix Sum: [1, 0, 1, 2, 1, 0]
  4. Answer Queries:

    • For query time 5: Use binary search, found index 0. So, result = prefixSum[0] = 1.
    • For query time 10: Index 0. So, result = prefixSum[0] = 1.
    • For query time 15: Index 2. So, result = prefixSum[2] = 1.
    • For query time 20: Index 2. So, result = prefixSum[2] = 1.
    • For query time 25: Index 3. So, result = prefixSum[3] = 2.
    • For query time 30: Index 4. So, result = prefixSum[4] = 1.

Output: [1, 1, 1, 1, 2, 1]

Code

Java
Saved to Cloud

. . . .

Complexity Analysis

Time Complexity

  1. Creating Events: For n flowers, we create 2n events (start and end for each flower). This step takes time.
  2. Sorting Events: Sorting 2n events takes = time.
  3. Prefix Sum Calculation: Calculating the prefix sum for bloom counts across all events takes = time, as we iterate through each event once.
  4. Answering Queries: For each of m persons, we perform a binary search among the events to find the bloom count. Each binary search takes time, leading to a total of for this step.

Overall, the time complexity is , where n is the number of flowers and m is the number of persons.

Space Complexity

  1. Event Storage: Storing 2n events requires = space.
  2. Prefix Sum Array: The prefix sum array also requires = space.
  3. Output Array: The output array for m queries requires space.

The space complexity is therefore , accounting for the storage of events, prefix sums, and the output array.

Number of Flowers in Full Bloom (hard)
Median of Two Sorted Arrays (hard)
Mark as Completed

On this page

Problem Statement

Examples

Solution

Step-by-Step Algorithm

Algorithm Walkthrough

Code

Complexity Analysis

Time Complexity